The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
نویسندگان
چکیده
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(B). Extending the algebraic methods of a previous paper, we derive a complete complexity classification for these problems as B ranges over structures of domain size 4. Specifically, each problem is either in L, is NP-complete, is co-NP-complete or is Pspace-complete.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملFinite Schematizable Algebraic Logic
In this work, we attempt to alleviate three (more or less) equivalent negative results. These are (i) non-axiomatizability (by any finite schema) of the valid formula schemas of first order logic, (ii) non-axiomatizability (by finite schema) of any propositional logic equivalent with classical first order logic (i.e., modal logic of quantification and substitution), and (iii) non-axiomatizabili...
متن کاملBeyond first order logic: From number of structures to structure of numbers: Part II
We study the history and recent developments in nonelementarymodel theory focusing on the framework of abstractelementary classes. We discuss the role of syntax and semanticsand the motivation to generalize first order model theory to nonelementaryframeworks and illuminate the study with concrete examplesof classes of models. This second part continues to study the question of catecoricitytrans...
متن کاملOn the complexity of the model checking problem
The model checking problem for various fragments of first-order logic has attracted much attention over the last two decades: in particular, for the fragment induced by ∃ and ∧ and that induced by ∀,∃ and ∧, which are better known as the constraint satisfaction problem and the quantified constraint satisfaction problem, respectively. These two fragments are in fact the only ones for which there...
متن کاملEquality-free Logic: The Method of Diagrams and Preservation Theorems
In this article I prove preservation theorems for the positive and for the universal-existential fragment of equality-free logic. I give a systematic presentation of the method of diagrams for first-order languages without equality.
متن کامل